منابع مشابه
Henkin quantifiers and complete problems
Certain applications of logic to computer science, for example those discus: in [4], have the following features: only finite models are of interest, first-order logic is not sufficiently expressive. Accordingly, various extensions first-order logic have been proposed and analyzed for finite structures. " analysis often reveals connections with computational complexity, and ind some of the exte...
متن کاملDecidability Problems in Languages with Henkin Quantifiers
Krynicki, M. and M. Mostowski, Decidability problems in languages with Henkin quantifiers, Annals of Pure and Applied Logic 58 (1992) 149-172. We consider the language L(H,) with all Henkin quantifiers H, defined as follows: H,,x,...x,y,.~.y, 4(x,,..., x,, Y,, . , Y,) iff 3f, . . .f, Vxx, . . .x, 9(x,, . . ,x,, f,(xA . , f,(x,)). We show that the theory of equality in L(H,) is undecidable. The ...
متن کاملHenkin and Function Quantifiers
Henkin [7] introduced quantifiers which arise when usual (universal and existential) quantifiers are arranged in non-linear order. These quantifiers bre known as partially ordered quantifiers or Henkin quantifiers. Is. was observed already in [7] that languages with these quantifiers are stronger than first-order logic. A result of [ll] shows that even the weakest enkin quantifier has essential...
متن کاملExotic Quantifiers, Complexity Classes, and Complete Problems
We introduce some operators defining new complexity classes from existing ones in the Blum-Shub-Smale theory of computation over the reals. Each one of these operators is defined with the help of a quantifier differing from the usual ones, ∀ and ∃, and yet having a precise geometric meaning. Our agenda in doing so is twofold. On the one hand, we show that a number of problems whose precise comp...
متن کاملHenkin quantifiers and Boolean formulae: A certification perspective of DQBF
Article history: Received 16 October 2012 Received in revised form 4 November 2013 Accepted 20 December 2013 Communicated by N. Shankar
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1986
ISSN: 0168-0072
DOI: 10.1016/0168-0072(86)90040-0